Note on Integral Distances

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on Integral Distances

A planar point set S is called an integral set if all the distances between the elements of S are integers. We prove that any integral set contains many collinear points or the minimum distance should be relatively large if |S| is large.

متن کامل

A note on distinct distances

We show that, for a constant-degree algebraic curve γ in R, every set of n points on γ spans at least Ω(n) distinct distances, unless γ is an algebraic helix (see Definition 1.1). This improves the earlier bound Ω(n) of Charalambides [2]. We also show that, for every set P of n points that lie on a d-dimensional constantdegree algebraic variety V in R, there exists a subset S ⊂ P of size at lea...

متن کامل

A Note on Concepts and Distances

We combine the description logic ALC with the metric logics defined in [15]. Entities that are conceived of as abstract points in the realm of ALC are given a spatial extension via an ‘extension relation,’ connecting abstract points in the domain of an ALC-model to points in a metric space. Conversely, regions in the metric space are connected via the converse ‘extension relation’ to certain po...

متن کامل

A Note on Retarded Ouyang Integral Inequalities

In this note, we generalize two retarded Ouyang integral inequalities. One of these inequalities says: under suitable assumptions of functions w,α, h, f, g and p on [0,∞), if w(t) ≤ h(t) + 2 ∫ α(t) 0 { f(s)w(s) [ w(s) + ∫ s 0 g(r)w(r)dr ] + p(s)w(s) } ds, then w(t) ≤ [ h(t) + ∫ α(t) 0 p(s)ds ] exp {∫ α(t) 0 [ f(s) + (∫ s 0 g(r)dr ) ds ]} , t ≥ 0. AMS Subject Classifications: 26D15.

متن کامل

A Note on Learning with Integral Operators

A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods, are based on estimating eigenvalues and eigenfunctions of operators defined by a similarity function or a kernel, given empirical data. Thus for the analysis of algorithms, it is an important problem to be able to assess the quality of such approximations. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete and Computational Geometry

سال: 2003

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-003-0014-7